Topological Indices Based on Topological Distances in Molecular Graphs
نویسنده
چکیده
Three new distance—based topological indices are described; two of them, D and D1 (mean distance topological indices, for any graphs, and for acyclic graphs, respectively) have a modest discriminating ability but may be useful for correlations, e. g. with octane numbers. The third index, J (average distance sum connectivity) is the least degenerate single topological index proposed till now. The properties of this promising index J are discussed in more detail.
منابع مشابه
Comparison of Topological Indices Based on Iterated ‘Sum’ versus ‘Product’ Operations
The Padmakar-Ivan (PI) index is a first-generation topological index (TI) based on sums over all edges between numbers of edges closer to one endpoint and numbers of edges closer to the other endpoint. Edges at equal distances from the two endpoints are ignored. An analogous definition is valid for the Wiener index W, with the difference that sums are replaced by products. A few other TIs are d...
متن کاملDistance-based topological indices of tensor product of graphs
Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...
متن کاملUse of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کامل